Runtime home mapping for effective memory resource usage
نویسندگان
چکیده
منابع مشابه
Runtime home mapping for effective memory resource usage
In tiled Chip Multiprocessors (CMPs) last-level cache (LLC) banks are usually shared but distributed among the tiles. A static mapping of cache blocks to the LLC banks leads to poor efficiency since a block may be mapped away from the tiles actually accessing it. Dynamic policies either rely on the static mapping of blocks to a set of banks (D-NUCA) or rely on the OS to dynamically load pages t...
متن کاملMemory usage improvement using runtime alias detection
Tofte and Talpin proposed a novel method for memory management called region inference in typed, higher-order languages[7]. In their method, memory is composed of blocks called regions, and when to allocate and deallocate regions are determined automatically by the compiler using a type system, and source programs are translated into target programs with region annotations. Their method realize...
متن کاملExploiting Single-Usage for Effective Memory Management
Efficient memory management is crucial when designing high performance processors. Upon a miss, the conventional operation mode of a cache hierarchy is to retrieve the missing block from lower levels and to store it into all hierarchy levels. It is however difficult to assert that storing the block into intermediate levels will be really useful. In particular, this is unnecessary if a cache blo...
متن کاملA THEORETICALLY CORRECT RESOURCE USAGE VISUALIZATION FOR THE RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM
The cumulative resource constraints of the resource-constrained project scheduling problem (RCPSP) do not treat the resource demands as geometric rectangles, that is, activities are not necessarily assigned to the same resource units over their processing times. In spite of this fact, most papers on resource-constrained project scheduling mainly in the motivation phase use a strip packing of re...
متن کاملKNN Kernel Shift Clustering with Highly Effective Memory Usage
This paper presents a novel clustering algorithm with highly effective memory usage. The algorithm, called kNN kernel shift, classifies samples based on underlying probability density function. In clustering algorithms based on density, a local mode of the density represents a cluster center. It is effective to shift each sample to a point having higher density, considering the density gradient...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Microprocessors and Microsystems
سال: 2014
ISSN: 0141-9331
DOI: 10.1016/j.micpro.2014.03.008